From Task Definitions and Plan Traces to HTN Methods
نویسنده
چکیده
Hierarchical Task Network (HTN) planning is an important, frequently studied research topic in artificial intelligence. Researchers have reported work on its formalisms and applications (Erol, Hendler, & Nau 1994; Smith, Nau, & Erol 1998; Nau et al. 2005). In HTN planning, complex tasks are decomposed into simpler tasks until a sequence of primitive actions is generated. HTN planning is frequently studied because it is analogous to a common model of human thought and because it has allowed impressive gains in execution time when compared to classical planners. Despite these advantages, a major hurdle for the use of HTN planning is the need for an HTN domain description. In fact, a controversy in the AI planning research community surrounds the recent efficiency gains obtained with HTN planning because the domain descriptions sketch the underpinnings of the solutions. Therefore, it has been argued that a significant knowledge engineering effort is required to obtain such domain descriptions. A domain description is a collection of knowledge constructs describing the target domain. In HTN planning, a domain description consists of the action model and the task model. The action model encodes knowledge about valid actions or primitive tasks changing the world state. The task model encodes knowledge about how to decompose tasks into subtasks, and is the part of the domain description that has been argued to be difficult to obtain. Given the large interest in HTN planning, it is surprising that little research has been done on learning task models. The bulk of research involving planning and learning has focused on search control knowledge (Zimmerman & Kambhampati 2003). We present HTN-MAKER (Hierarchical Task Networks with Minimal Additional Knowledge Engineering Required), an offline and incremental algorithm for learning task models. HTN-MAKER receives as input a collection of plans generated by a STRIPS planner, an action model, and a collection of task definitions, and it produces a task model. When combined with the action model, this task model results in an HTN domain model that may be used by an HTN planner to solve problems in the domain. An extended version of this paper has been submitted to the Planning and Learning workshop at ICAPS-07, which includes a description of the learning algorithm and empirical evaluation. Related Research
منابع مشابه
Learning Hierarchical Task Networks from Plan Traces
We present HTN-MAKER, an offline and incremental algorithm for learning the structural relations between tasks in a Hierarchical Task Network (HTN). HTN-MAKER receives as input a STRIPS domain model, a collection of STRIPS plans, and a collection of task definitions, and produces an HTN domain model. HTN-MAKER is capable of learning an HTN domain model that reflects the provided task definition...
متن کاملLearning hierarchical task network domains from partially observed plan traces
Hierarchical Task Network (HTN) planning is an effective yet knowledge intensive problem-solving technique. It requires humans to encode knowledge in the form of methods and action models. Methods describe how to decompose tasks into subtasks and the preconditions under which those methods are applicable whereas action models describe how actions change the world. Encoding such knowledge is a d...
متن کاملLearning to Do HTN Planning
We describe the HDL algorithm, which learns HTN domain representations by examining plan traces produced by an expert problem-solver. Prior work on learning HTN methods required everything to be given in advance except for the methods’ preconditions, and the learner would learn the preconditions. In contrast, HDL has no prior information about the methods. In our experiments, in most cases HDL ...
متن کاملLearning Hierarchical Task Models from Input Traces
We describe HTN-Maker, an algorithm for learning hierarchical planning knowledge in the form of task-reduction methods for Hierarchical Task Networks (HTNs). HTN-Maker takes as input a set of planning states from a classical planning domain and plans that are applicable to those states, as well as a set of semantically-annotated tasks to be accomplished. The algorithm analyzes this semantic inf...
متن کاملAdaptation of Hierarchical Task Network Plans
This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair. RepairSHOP is built on top of the HTN planner SHOP. RepairSHOP has three properties. The first property is its design modularity, which makes it is straightforward to apply the same process discussed in this paper to build plan adaptation capabilities in other HTN planners. Second, RepairSHOP can perf...
متن کامل